Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
561	Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem∗ Manindra Agrawal† Department of Computer Science Indian Institute of Technology Kanpur Add to Reading List Source URL: www.cse.iitk.ac.in Language: English - Date: 2006-11-19 23:12:18 Complexity classes Circuit complexity Computability theory Mathematical optimization FO NP-complete P versus NP problem Time complexity Reduction Theoretical computer science Computational complexity theory Applied mathematics
562	Recent progress on point-counting algorithms David Harvey University of New South Wales 1st October 2013, University of Sydney Add to Reading List Source URL: web.maths.unsw.edu.au Language: English - Date: 2013-10-04 02:06:12 Algebraic curves Group theory Analytic number theory Field theory Polynomial Computational complexity theory Elliptic curve Hyperelliptic curve Prime number Abstract algebra Mathematics Algebra
563	Flexible Resource Allocation for Optical Networks Dmitriy Katz1 , Baruch Schieber1 , and Hadas Shachnai2? 1 IBM T.J. Watson Research Center, Yorktown Heights, NY 10598. Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2014-04-27 19:14:38 Operations research Computational complexity theory Approximation algorithms Complexity classes Mathematical optimization Polynomial-time approximation scheme Dynamic programming Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics
564	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community fpt.wikidot.com May 2009 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:57:59 NP-complete problems Analysis of algorithms Graph coloring Parameterized complexity Complexity classes Kernelization Time complexity Clique problem Vertex cover Theoretical computer science Computational complexity theory Graph theory
565	Parameterized Complexity News The Newsletter of the Parameterized Complexity Community Volume 4, AprilWelcome Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-09-04 05:58:10 NP-complete problems Analysis of algorithms Parameterized complexity Complexity classes Kernelization Dominating set Feedback vertex set Michael Fellows Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
566	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On a geometric approach to the segment sum problem and its generalization Asish Mukhopadhyay ∗† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:26:37 Analysis of algorithms Time complexity Algorithm Selection algorithm SL Theoretical computer science Computational complexity theory Applied mathematics
567	Linear Time Nonparametric Classification and Feature Selection with Polynomial MPMC Cascades for large datasets Markus Breitenbach1 , Sander M. Bohte1,2 , and Gregory Z. Grudic1 1 Add to Reading List Source URL: markus-breitenbach.com Language: English - Date: 2004-06-24 11:16:08 Applied mathematics Linear classifier Ensemble learning Time complexity Support vector machine Algorithm Computational complexity theory Stability Boosting methods for object categorization Machine learning Statistics Statistical classification
568	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 The Generalized Minimum Manhattan Network Problem (GMMN) – Scale-Diversity Aware Approximation and a Primal-Dual Algorithm Stefan Funke∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-06-21 05:15:26 Convex optimization Operations research Linear programming Mathematical optimization Approximation algorithm Computational complexity theory Optimization problem Duality Algorithm Theoretical computer science Applied mathematics Mathematics
569	Distributed Agreement with Optimal Communication Complexity Seth Gilbert EPFL Abstract We consider the problem of fault-tolerant agreement in Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:45:55 Analysis of algorithms Fault-tolerant computer systems Probabilistic complexity theory Consensus Randomized algorithm Distributed algorithm Factorial IP Time complexity Theoretical computer science Computational complexity theory Mathematics
570	CCCG 2011, Toronto ON, August 10–12, 2011 Exact Algorithms and APX-Hardness Results for Geometric Set Cover Timothy M. Chan∗ Abstract Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-06 04:11:12 Approximation algorithms Functions and mappings Computational complexity theory APX Logarithm Integral Function L-reduction Metric Mathematics Theoretical computer science Mathematical analysis

UPDATE